A General Tableau Method for Propositional Interval Temporal Logics
نویسندگان
چکیده
In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema’s CDT logic interpreted over partial orders (BCDT+ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that refer to time intervals. Unfortunately, most such logics turned out to be (highly) undecidable. To get decidability, severe syntactic and/or semantic restrictions have been imposed to interval-based temporal logics that make it possible to reduce them to point-based on...
متن کاملOptimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedure...
متن کاملA Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation
Interval temporal logics are quite expressive temporal logics, which turn out to be difficult to deal with in many respects. Even finite satisfiability of simple interval temporal logics presents non-trivial technical issues when it comes to the implementation of efficient tableaubased decision procedures. We focus our attention on the logic of Allen’s relation meets, a.k.a. Right Propositional...
متن کاملA Decidable Logic for Time Intervals: Propositional Neighborhood Logic
Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most time interval logics proposed in the literature are (highly) undecidable. Decidable fragments of these logics have been obtained by imposing severe restrictions on their expressive power. In this paper,...
متن کاملA Tableau Calculus for Temporal Description Logic : TheConstant Domain Case
We show how to combine the standard tableau system for the basic description logic ALC with Wolper's tableau calculus for propositional temporal logic PTL in order to design a terminating sound and complete tableau-based satissability-checking algorithm for the temporal description logic PTL ALC of 19] interpreted in models with constant domains. We use the method of quasimodels 16, 14] to repr...
متن کامل